Efficient Maximum Flow Maintenance on Dynamic Networks
نویسندگان
چکیده
While many efficient algorithms for the maximum flow problem have been proposed over the years, they are designed to work with static networks, and thus they need to recompute a new solution from scratch every time an update occurs. Such approaches are impractical in many current application where updates are frequent. To overcome these limitations, this paper proposes efficient incremental algorithms for maintaining the maximum flow in dynamic networks.
منابع مشابه
Maximum Flow of Minimum Bi-criteria Cost in Dynamic Networks
The article studies the generalisation of the maximum flow of minimum cost problem for the case of maximum discrete dynamic flow of minimum travelling cost and travelling time. The approach is based on iteratively generating efficient extreme points in the objective space by solving a series of single objective maximum flow problems with different objective functions. On each of the iterations,...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملEfficient continuous-time dynamic network flow algorithms
We extend the discrete-time dynamic ow algorithms presented in the literature to solve the analogous continuous-time dynamic ow problems. These problems include nding maximum dynamic ows, quickest ows, universally maximum dynamic ows, lexicographically maximum dynamic ows, dynamic transshipments, and quickest transshipments in networks with capacities and transit times on the edges.
متن کاملScheduling arc maintenance jobs in a network to maximize total flow over time ∗ Natashia Boland Thomas Kalinowski Hamish Waterer Lanbo Zheng
We consider the problem of scheduling a set of maintenance jobs on the arcs of a network so that the total flow over the planning time horizon is maximized. A maintenance job causes an arc outage for its duration, potentially reducing the capacity of the network. The problem can be expected to have applications across a range of network infrastructures critical to modern life. For example, util...
متن کاملScheduling arc maintenance jobs in a network to maximize total flow over time
We consider the problem of scheduling a set of maintenance jobs on the arcs of a network so that the total flow over the planning time horizon is maximized. A maintenance job causes an arc outage for its duration, potentially reducing the capacity of the network. The problem can be expected to have applications across a range of network infrastructures critical to modern life. For example, util...
متن کامل